An Efficient Approach to the Numerical Solution of Rate-Independent Problems with Nonconvex Energies
نویسندگان
چکیده
We propose a new approach to the numerical treatment of non(quasi)convex rate-independent evolutionary problems. The main idea is to replace the non(quasi)convex energy density by its polyconvexification. For this problem, first-order optimality conditions are derived and used in finding a discrete solution. The effectiveness of the method is illustrated with some numerical experiments.
منابع مشابه
An Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملNumerical and Analytical Approach for Film Condensation on Different Forms of Surfaces
This paper tries to achieve a solution for problems that concern condensation around a flat plate, circular and elliptical tube in by numerical and analytical methods. Also, it calculates entropy production rates. At first, a problem was solved with mesh dynamic and rational assumptions; next it was compared with the numerical solution that the result had acceptable errors. An additional suppor...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملAn efficient method for the numerical solution of Helmholtz type general two point boundary value problems in ODEs
In this article, we propose and analyze a computational method for numerical solution of general two point boundary value problems. Method is tested on problems to ensure the computational eciency. We have compared numerical results with results obtained by other method in literature. We conclude that propose method is computationally ecient and eective.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Multiscale Modeling & Simulation
دوره 9 شماره
صفحات -
تاریخ انتشار 2011